#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int n,a[N], ma=0,mi=0x3f3f3f3f;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int x;
        scanf("%d",&x);
        a[x]++;
        ma=max(ma,x);
        mi=min(mi,x);
    }
    int t=0;
    for(int i=mi;i<=ma+1;i++){
            t=max(t,a[i]);
    }
    printf("%d",t);
    return 0;
}
